MOMCMC: An efficient Monte Carlo method for multi-objective sampling over real parameter space

نویسنده

  • Yaohang Li
چکیده

In this paper,we present a newpopulation-basedMonte Carlomethod, so-calledMOMCMC (Multi-Objective Markov Chain Monte Carlo), for sampling in the presence of multiple objective functions in real parameter space. The MOMCMC method is designed to address the ‘‘multi-objective sampling’’ problem, which is not only of interest in exploring diversified solutions at the Pareto optimal front in the function space of multiple objective functions, but also those near the front. MOMCMC integrates Differential Evolution (DE) style crossover into Markov Chain Monte Carlo (MCMC) to adaptively propose new solutions from the current population. The significance of dominance is taken into consideration in MOMCMC’s fitness assignment scheme while balancing the solution’s optimality and diversity. Moreover, the acceptance rate in MOMCMC is used to control the sampling bandwidth of the solutions near the Pareto optimal front. As a result, the computational results of MOMCMC with the high-dimensional ZDT benchmark functions demonstrate its efficiency in obtaining solution samples at or near the Pareto optimal front. Compared to MOSCEM (Multiobjective Shuffled Complex Evolution Metropolis), an existing Monte Carlo sampling method for multi-objective optimization, MOMCMC exhibits significantly faster convergence to the Pareto optimal front. Furthermore, with small population size, MOMCMC also shows effectiveness in sampling complicated multiobjective function space. © 2012 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global optimization using the asymptotically independent Markov sampling method

In this paper, we introduce a new efficient stochastic simulation method, AIMS-OPT, for approximating the set of globally optimal solutions when solving optimization problems such as optimal performance-based design problems. This method is based on Asymptotically Independent Markov Sampling (AIMS), a recently developed advanced simulation scheme originally proposed for Bayesian inference. This...

متن کامل

Multi-resolution Genetic Algorithms and Markov Chain Monte Carlo

Due to modern advances in computing power, the use of increasingly complex models has become practical. One class of large models that often relies on numerical techniques for parameter estimation is multiresolution models. Unfortunately, numerical maximization and sampling techniques used to estimate parameters in such complex models often explore the parameter space slowly, resulting in unrel...

متن کامل

Radial Basis Function Regression Using Trans-dimensional Sequential Monte Carlo

We consider the general problem of sampling from a sequence of distributions that is defined on a union of subspaces. We will illustrate the general approach on the problem of sequential radial basis function (RBF) regression where the number of kernels is variable and unknown. Our approach, which we term Trans-Dimensional Sequential Monte Carlo (TD-SMC), is based on a generalisation of importa...

متن کامل

Hamiltonian Monte Carlo Acceleration Using Neural Network Surrogate functions

Relatively high computational cost for Bayesian methods often limits their application for big data analysis. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an efficient and scalable computational technique for a state-of-the-art Markov Chain Monte Carlo (MCMC) methods, namely, Hamiltonian Monte Carlo (HMC). The key idea...

متن کامل

Delayed Rejection schemes for efficient Markov chain Monte Carlo sampling of multimodal distributions

A number of problems in a variety of fields are characterised by target distributions with a multimodal structure in which the presence of several isolated local maxima dramatically reduces the efficiency of Markov chain Monte Carlo sampling algorithms. Several solutions, such as simulated tempering or the use of parallel chains, have been proposed to facilitate the exploration of the relevant ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2012